On the density of primes in arithmetic progression having a prescribed primitive root

نویسنده

  • Pieter Moree
چکیده

Let g ∈ Q be not −1 or a square. Let Pg denote the set of primes p such that g is a primitive root mod p. Let 1 ≤ a ≤ f, (a, f) = 1. Under the Generalized Riemann Hypothesis (GRH) it can be shown that the set of primes p ∈ Pg with p ≡ a(mod f) has a natural density. In this note this density is explicitly evaluated. This generalizes a classical result of Hooley.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On primes in arithmetic progression having a prescribed primitive root. II

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p ≡ a(mod f) and g is a primitive root modulo p has a natural density. In this note this density is explicitly evaluated with an Euler product as result.

متن کامل

The Least Prime Primitive Root and the Shifted Sieve

If p is a prime, we define g(p) to be the least prime that is a primitive root (mod p), and similarly for prime powers p. The problem of establishing a bound for g(p) uniformly in p is quite difficult, comparable with establishing a uniform upper bound for the least prime in an arithmetic progression. Indeed, there do not exist any uniform upper bounds for g(p) that improve upon the current bou...

متن کامل

Seven consecutive primes in arithmetic progression

It is conjectured that there exist arbitrarily long sequences of consecutive primes in arithmetic progression. In 1967, the first such sequence of 6 consecutive primes in arithmetic progression was found. Searching for 7 consecutive primes in arithmetic progression is difficult because it is necessary that a prescribed set of at least 1254 numbers between the first and last prime all be composi...

متن کامل

On the least prime primitive root modulo a prime

We derive a conditional formula for the natural density E(q) of prime numbers p having its least prime primitive root equal to q, and compare theoretical results with the numerical evidence. 1. Theoretical result concerning the density of primes with a given least prime primitive root Let us denote, following Elliott and Murata [4], by g(p) and G(p) the least primitive and the least prime primi...

متن کامل

M ar 2 00 7 Primes in a prescribed arithmetic progression dividing the sequence { a k + b k } ∞ k = 1

Given positive integers a, b, c and d such that c and d are coprime we show that the primes p ≡ c(mod d) dividing ak + bk for some k ≥ 1 have a natural density and explicitly compute this density. We demonstrate our results by considering some claims of Fermat that he made in a 1641 letter to Mersenne. Mathematics Subject Classification (2001). 11N37, 11R45.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999